The necessity of deriving the upper bounds on the contention delay due to the shared memory bus is an indispensable
prerequisite in order to compute the worst-case execution time of tasks that need to conform to stringent temporal constraints. In this work, 
we proposed a method to model the availability of the bus and leveraged this model further to compute the increased delay that a task incurs
when co-scheduled with other tasks contending on the bus. The proposed algorithm also presented a general interface into which different arbiters can be seamlessly plugged to compute the resulting
WCET. We also demonstrated the applicability of our framework for two different arbiters: a non-work-conserving TDM arbiter and work-conserving fixed-priority arbiter. 

